Coarse Grained Parallel Selection
نویسندگان
چکیده
Several efficient, but non-optimal, solutions to the Selection Problem on coarse grained parallel computers have appeared in literature. We consider example of Saukas-Song algorithm; we analyze it without expressing running time terms communication rounds. This shows that while best case algorithm runs asymptotically optimal time, general does not. propose another for selection has expected time.
منابع مشابه
The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting
We analyze the running time of the Saukas-Song algorithm for selection on a coarse grained multicomputer without expressing the running time in terms of communication rounds. We derive sorting algorithms that are asymptotically optimal for restricted ranges of processors on coarse grained multicomputers.
متن کاملPractical Algorithms for Selection on Coarse-Grained Parallel Computers
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. Experimental results on the CM5 demonstrate that randomized algorithms are superior to their deterministic counterparts.
متن کاملCoarse-Grained Parallel Geometric Search
We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h = O(n/p)), O((n/p) log n) local computation, and O((n/p) log p) memory per processor, assuming n/p ≥ p. Our result implies solutions to the point l...
متن کاملCoarse-grained Parallel Computing on Heterogeneous Systems Heterogeneous Coarse-grained Parallel Computing
We consider the problem of nding eecient parallel algorithms for heterogeneous parallel computers, i.e., parallel computers in which dierent processors have dier-ent computational potential. To this end, we dene a formal computational model for heterogeneous systems and develop algorithms for commonly used communication operations. The result is that many existing parallel algorithms which use ...
متن کاملCoarse grained parallel algorithms for graph matching
Parallel graph algorithm design is a very well studied topic. Many results have been presented for the PRAM model. However, these algorithms are inherently fine grained and experiments show that PRAM algorithms do often not achieve the expected speedup on real machines because of large message overheads. In this paper, we present coarse grained parallel graph algorithms with small message overh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2021
ISSN: ['0129-6264', '1793-642X']
DOI: https://doi.org/10.1142/s0129626421500031